منابع مشابه
A Direct-Sum Theorem for Read-Once Branching Programs
We study a direct-sum question for read-once branching programs. If M(f) denotes the minimum average memory required to compute a function f(x1, x2, . . . , xn) how much memory is required to compute f on k independent inputs that arrive in parallel? We show that when the inputs are sampled independently from some domain X and M(f) = Ω(n), then computing the value of f on k streams requires ave...
متن کاملDirect Sum Theorem for Bounded Round Quantum Communication Complexity
We prove a direct sum theorem for bounded round entanglement-assisted quantum communication complexity. To do so, we use the fully quantum definition for information cost and complexity that we recently introduced, and use both the fact that information is a lower bound on communication, and the fact that a direct sum property holds for quantum information complexity. We then give a protocol fo...
متن کاملEgoroff Theorem for Operator-Valued Measures in Locally Convex Cones
In this paper, we define the almost uniform convergence and the almost everywhere convergence for cone-valued functions with respect to an operator valued measure. We prove the Egoroff theorem for Pvalued functions and operator valued measure θ : R → L(P, Q), where R is a σ-ring of subsets of X≠ ∅, (P, V) is a quasi-full locally convex cone and (Q, W) is a locally ...
متن کاملA Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a protocol, as defined by Chakrabarti et al. [CSWY01] and refined further by Bar-Yossef et al. [BJKS02]. Our main technical result is a ‘compression’ theorem saying that, for any probability distribution μ over the inputs...
متن کاملImproved direct sum theorem in classical communication complexity
For a function f : X ×Y → Z , the m-fold direct sum is the function f : X × Y → Z, defined by f(〈x1, . . . , xm〉, 〈y1, . . . , ym〉) ∆ = 〈f(x1, y1), . . . , f(xm, ym)〉. We show the following direct sum theorem for classical communication protocols, R(f) = Ω( m k R(f)) where R(f) is the the k-round private coins communication complexity of f and R(f) is the k-round public coin complexity of f . I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1947
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1947-0019619-8